The Super-Connectivity of the Double Vertex Graph of Complete Bipartite Graphs

Let $ G=(V,E) be a graph. The double vertex graph $F_2(G)$ of G is the whose set consists all 2 $-subsets V(G) such that two vertices are adjacent in F_2(G) if their symmetric difference pair $. super--connectivity connected minimum number removal results disconnected without an isolated vertex. In this paper, we determine complete bipartite K_{m,n} for m\geq 4 where n\geq m+2